/*
https://leetcode.cn/problems/reverse-bits/
190. 颠倒二进制位
*/
class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t num=0;
        for(int i=31;i>=0;--i)
        {
        num=(num<<1)|(n&1);
         n>>=1;
         }
        return num;

    }
};